<!DOCTYPE html>
<html>

<head>
<meta charset="UTF-8">

<title> 提交记录 4640 - Judge Duck Online </title>

<link rel="icon" type="image/png" href="/images/judgeduck-logo-small.png" />

<script src="/libs/js/jquery-3.2.1.min.js"></script>

<!-- Latest compiled and minified CSS -->
<link rel="stylesheet" href="/libs/css/bootstrap.min.css" />

<!-- Latest compiled and minified JavaScript -->
<script src="/libs/js/bootstrap.min.js"></script>

<link rel="stylesheet" type="text/css" href="/css/main.css" />
<link rel="stylesheet" href="/css/non-responsive.css" type="text/css" />

<script src="/js/md5.js"></script>
<script src="/js/judgeduck.js"></script>

<script type="text/x-mathjax-config">
	MathJax.Hub.Config({
		showProcessingMessages: false,
		tex2jax: {
			inlineMath: [["$", "$"], ["\\\\(", "\\\\)"]],
			processEscapes:true
		},
		menuSettings: {
			zoom: "Hover"
		}
	});
</script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@2.7.1/MathJax.js?config=TeX-AMS_HTML"></script>

<link rel="stylesheet" href="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.css">
<script src="https://cdn.jsdelivr.net/simplemde/latest/simplemde.min.js"></script>

</head>

<body onload="">

<!-- Fixed navbar -->
<nav class="navbar navbar-default" role="navigation" style="background-color: #eeeeee">
	<div class="container">
		<div class="navbar-header">
			<div class="navbar-brand">
				<a href="/">
					<img src="/images/judgeduck-logo.png" width="40px" height="40px" style="margin:-10px" />
				</a>
			</div>
			<font class="navbar-brand">
				Judge Duck Online
			</font>
		</div>
		<div class="navbar-collapse collapse">
			<ul class="nav navbar-nav">
				<li class="nav-item">
					<a class="nav-link" href="/index/index.html"> 首页 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/problems/index.html"> 题目列表 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/submissions/index.html"> 提交记录 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/blogs/index.html"> 博客 </a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/faq/index.html"> FAQ </a>
				</li>
			</ul>
			<ul class="nav navbar-nav navbar-right">
				<li class="nav-item">
					<a data-toggle="collapse" href="#detail_20" aria-expanded="false" aria-controls="detail_20">显示更多</a>
<a style="display:inline-block;background-color:;color:#fff;padding:2px 5px;font-family:arial;font-size:12px;font-weight:bold;" href="http://www.iis7.com" id="ba678def1bf8444ab9501b0f17ec4a9c" target="_blank">iis7站长之家</a>
				</li>
				<li class="nav-item">
					<a class="nav-link" href="/user/register/index.html"> 注册 </a>
				</li>
			</ul>
		</div><!--/.nav-collapse -->
	</div>
</nav>




<div id="main_div" class="container" style="padding-left: 25px; padding-right: 25px">
	<h2> 提交记录 4640 </h2>
	<hr />
	
	<div class="row">
		<div class="col-xs-12">
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-2"> 用户 </th>
					<th class="col-xs-3"> 题目 </th>
					<th class="col-xs-2"> 状态 </th>
					<th class="col-xs-1"> 得分 </th>
					<th class="col-xs-1"> 用时 </th>
					<th class="col-xs-1"> 内存 </th>
					<th class="col-xs-1"> 语言 </th>
					<th class="col-xs-1"> 代码长度 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> <a href='/user/profile/jhdjames37/index.html'> jhdjames37 </a> </td>
<td> <a href='/problem/noi18e/index.html'> noi18e. 【NOI2018】情报中心 </a> </td>
<td> Accepted </td>
<td> 100 </td>
<td style='font-size:13px'> 3.529 s </td>
<td style='font-size:13px'> 162 MB + 440 KB </td>
<td style='font-size:13px'> C++11 </td>
<td style='font-size:13px'> 8.78 KB </td>
				</tr>
			</table>
			<table class="table table-bordered">
				<tr>
					<th class="col-xs-6"> 提交时间 </th>
					<th class="col-xs-6"> 评测时间 </th>
				</tr>
				<tr>
					<td style='font-size:13px'> 2018-07-27 10:49:25 </td>
<td style='font-size:13px'> 2019-01-19 04:24:31 </td>
				</tr>
			</table>
			<link rel="stylesheet" href="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/styles/tomorrow.min.css">
			<script src="//cdn.jsdelivr.net/gh/highlightjs/cdn-release@9.12.0/build/highlight.min.js"></script>
			<script>hljs.initHighlightingOnLoad();</script>
			<div class="row">
				<label for="code"> 代码 </label>
				<pre style="background-color:white"><code class="cpp">#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;algorithm&gt;
#include &lt;utility&gt;
#include &lt;map&gt;
#include &lt;cctype&gt;
const int MAXN = 5e4 + 10;
const int MAXM = 1e5 + 10;
typedef long long LL;
const LL INF = 1e18;

struct Edge {
  int v, w, next;
}edge[MAXN &lt;&lt; 1];
int head[MAXN], tail = 1;
int weight[MAXN];
int x[MAXM], y[MAXM];
LL v[MAXM];
int n, m;
void insert(int u, int v, int w) {
  edge[++tail] = (Edge) {v, w, head[u]}; head[u] = tail;
}
namespace io{
  const int SIZE = 1e6;
  char buff[SIZE];
  char *l, *r;
  void init() {
    l = buff;
    r = l + fread(buff, 1, SIZE, stdin);
  }
  char gc() {
    if (l == r) init();
    return *(l++);
  }
  template &lt;class T&gt; inline
  void read(T &amp;x) {
    x = 0; char ch = gc();
    while(!isdigit(ch)) ch = gc();
    while(isdigit(ch)) x = x * 10 + ch - &#x27;0&#x27;, ch = gc();
  }
} using io::read;
namespace solver1 {

  namespace calc_lca {
    int dep[MAXN], sz[MAXN], top[MAXN], fa[MAXN], son[MAXN];
    LL len[MAXN];
    void dfs(int u, int f) {
      dep[u] = dep[f] + 1;
      fa[u] = f;
      int max_son = 0;
      sz[u] = 1;
      
      for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        len[v] = len[u] + edge[i].w;
        dfs(v, u);
        sz[u] += sz[v];
        if (sz[v] &gt; max_son) {
          max_son = sz[v];
          son[u] = v;
        }
      }
    }
    void dfs2(int u, int t) {
      top[u] = t;
      if (son[u]) {
        dfs2(son[u], t);
      }
      for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        if (v == son[u]) continue;
        dfs2(v, v);
      }
    }
    void init() {
      std::fill(son + 1, son + n, 0);
      dfs(1, 0);
      dfs2(1, 1);
    }
    int lca(int x, int y) {
      while(top[x] != top[y]) {
        if (dep[top[x]] &lt; dep[top[y]]) std::swap(x, y);
        x = fa[top[x]];
      }
      return dep[x] &lt; dep[y] ? x : y;
    }
  }using calc_lca::lca; using calc_lca::len; using calc_lca::dep;
  LL ans, delta;
  void chk_ans(LL val) {
    ans = std::max(ans, val + delta);
  }
  struct Data {
    typedef std::pair&lt;int, LL&gt; Pii;
    Pii p1, p2;
    LL ans;
    Data (): p1({-1, -1}), p2({-1, -1}), ans(-INF) {}
    Data (int p, LL val): p1({p, val}), p2({-1, -1}), ans(-INF)  {}
    LL calc(Pii p1, Pii p2) {
      if (p1.first == -1 || p2.first == -1) return -INF;
      int l = lca(p1.first, p2.first);
      return p1.second + p2.second + len[p1.first] + len[p2.first] - 2 * len[l];
    }
    void merge(const Data&amp; rhs, const LL det) {
      if (p1.first == -1) { *this = rhs; return; }
      if (rhs.p1.first == -1) return;
      
      Pii _p1 = p1, _p2 = p2; LL t;
      delta = det;
      if (rhs.ans &gt; ans) {
        ans = rhs.ans;
        _p1 = rhs.p1;
        _p2 = rhs.p2;
      }

      if ((t = calc(p1, rhs.p1)) &gt; ans) {
        ans = t;
        _p1 = p1;
        _p2 = rhs.p1;
      }
      chk_ans(t);
        
      if ((t = calc(p1, rhs.p2)) &gt; ans) {
        ans = t;
        _p1 = p1;
        _p2 = rhs.p2;
      }
      chk_ans(t);
  
      if ((t = calc(p2, rhs.p1)) &gt; ans) {
        ans = t;
        _p1 = p2;
        _p2 = rhs.p1;
      }
      chk_ans(t);
      
      if ((t = calc(p2, rhs.p2)) &gt; ans) {
        ans = t;  
        _p1 = p2;
        _p2 = rhs.p2;
      }
      chk_ans(t);
      
      p1 = _p1;
      p2 = _p2;
    }
  };
  namespace seg_tree {
    const int SIZE = 5e6;
    struct Node {
      int ls, rs;
      LL max1, max2;
    }tree[SIZE];
    int root[MAXN], cnt;
    int newnode() {
      int u = ++cnt;
      tree[u].ls = tree[u].rs = 0;
      tree[u].max1 = tree[u].max2 = -INF;
      return u;
    }
    void init() {
      std::fill(root + 1, root + n + 1, 0);
      cnt = -1;
      newnode();
    }
    void update(int node) {
      Node &amp;u = tree[node];
      u.max1 = std::max(tree[u.ls].max1, tree[u.rs].max1);
      u.max2 = std::max(tree[u.ls].max2, tree[u.rs].max2);
    }
    void _merge(int &amp;x, int y, int l, int r, LL left, LL right) {
      if (!y) return;
      if (!x) {
        x = y;
        chk_ans((tree[y].max1 + right) * 2);
        chk_ans((tree[y].max2 + left) * 2);
        return;
      }
      if (l == r) {
        tree[x].max1 = std::max(tree[x].max1, tree[y].max1);
        tree[x].max2 = std::max(tree[x].max2, tree[y].max2);
        chk_ans((tree[y].max1 + right) * 2);
        chk_ans((tree[y].max2 + left) * 2);
        return;
      }

      int mid = (l + r) &gt;&gt; 1;
      LL nl = std::max(tree[tree[x].ls].max1, left);
      _merge(tree[x].ls, tree[y].ls, l, mid, left, std::max(tree[tree[x].rs].max2, right));
      _merge(tree[x].rs, tree[y].rs, mid + 1, r, nl, right);
      update(x);
    }
    void merge(int x, int y, LL det) {
      delta = det;
      _merge(root[x], root[y], 1, n, -INF, -INF);
    }
    int p;
    LL val1, val2;
    LL left, right;
    void _insert(int &amp;node, int l, int r) {
      if (!node) node = newnode();
      if (l == r) {
        tree[node].max1 = std::max(tree[node].max1, val1);
        tree[node].max2 = std::max(tree[node].max2, val2);
        chk_ans((left + val2) * 2);
        chk_ans((right + val1) * 2);
        return;
      }
      int mid = (l + r) &gt;&gt; 1;
      if (p &lt;= mid) {
        right = std::max(tree[tree[node].rs].max2, right);
        _insert(tree[node].ls, l, mid);
      } else {
        left = std::max(tree[tree[node].ls].max1, left);
        _insert(tree[node].rs, mid + 1, r);
      }
      update(node);
    }
    void insert(int x, int y, LL v1, LL v2, LL det) {
      val1 = v1, val2 = v2, p = y;
      left = right = -INF;
      delta = det;
      
      _insert(root[x], 1, n);

    }

    void _remove(int node, int l, int r) {
      if (!node) return;
      if (l == r) {
        tree[node].max1 = tree[node].max2 = -INF;
        return;
      }
      int mid = (l + r) &gt;&gt; 1;
      if (p &lt;= mid) _remove(tree[node].ls, l, mid);
      else _remove(tree[node].rs, mid + 1, r);
      update(node);
    }
    void remove(int x, int y) {
      p = y;
      _remove(root[x], 1, n);
    }
    void _print(int node, int l, int r) {
      if (!node) return;
      if (l == r) {
        fprintf(stderr, &quot;[%d]: max1 = %lld, max2 = %lld\n&quot;, l, tree[node].max1, tree[node].max2);
        return;
      }
      int mid = (l + r) &gt;&gt; 1;
      _print(tree[node].ls, l, mid);
      _print(tree[node].rs, mid + 1, r);
    }
    void print(int x) {
      fprintf(stderr, &quot;Tree %d:\n&quot;, x);
      _print(root[x], 1, n);
    }
  }
  std::map&lt;int, Data&gt; f[MAXN];
  
  void dfs(int u) {
    for (int i = head[u]; i; i = edge[i].next) {
      int v = edge[i].v;
      //fprintf(stderr, &quot;%d %d\n&quot;, u, v);
      dfs(v);
      
      seg_tree::remove(v, dep[u]);
      seg_tree::merge(u, v, -len[u] * 2);
      //ans = std::max(ans, (seg_tree::merge(u, v) - len[u]) * 2);
      //fprintf(stderr, &quot;%d %d(1): %lld\n&quot;, u, v, ans);
      if (f[u].size() &lt; f[v].size()) f[u].swap(f[v]);

      for (auto j: f[v]) {
        if (dep[j.first] &gt;= dep[u]) continue;
        f[u][j.first].merge(j.second, -len[u] * 2);
        //ans = std::max(ans, f[u][j.first].ans - len[u] * 2);
      }
      f[u].erase(u);
      //fprintf(stderr, &quot;%d %d(2): %lld\n&quot;, u, v, ans);
    }
  }
  void main() {
    calc_lca::init();
    for (int i = 1; i &lt;= n; i++) {
      f[i].clear();
    }

    seg_tree::init();
    ans = -INF;    
    for (int i = 1; i &lt;= m; i++) {
      int l = lca(x[i], y[i]);
      //fprintf(stderr, &quot;%d\n&quot;, l);
      LL dist = len[x[i]] + len[y[i]] - len[l] * 2;
      if (x[i] != l) {
        f[x[i]][l].merge(Data({y[i], dist + len[x[i]] - 2 * v[i]}), -len[x[i]] * 2);
        //ans = std::max(ans, f[x[i]][l].ans - len[x[i]] * 2);
        //ans = std::max((seg_tree::insert(x[i], dep[l], dist - v[i], dist - v[i] + len[l]) - len[x[i]]) * 2, ans);
        seg_tree::insert(x[i], dep[l], dist - v[i], dist - v[i] + len[l], -len[x[i]] * 2);
      }
      
      if (y[i] != l) {
        f[y[i]][l].merge(Data({x[i], dist + len[y[i]] - 2 * v[i]}), -len[y[i]] * 2);
        //ans = std::max(ans, f[y[i]][l].ans - len[y[i]] * 2);
        //ans = std::max((seg_tree::insert(y[i], dep[l], dist - v[i], dist - v[i] + len[l]) - len[y[i]]) * 2, ans);
        seg_tree::insert(y[i], dep[l], dist - v[i], dist - v[i] + len[l], -len[y[i]] * 2);
      }
    }

    //fprintf(stderr, &quot;%lld\n&quot;, ans);
    dfs(1);

    if (ans &lt; (-INF / 2)) puts(&quot;F&quot;);
    else printf(&quot;%lld\n&quot;, ans / 2);
    
    
  }
}
int main() {
  //freopen(&quot;center.in&quot;, &quot;r&quot;, stdin);
  //freopen(&quot;center.out&quot;, &quot;w&quot;, stdout);
  int t;
  //scanf(&quot;%d&quot;, &amp;t);
  read(t);
  while(t--) {
    //scanf(&quot;%d&quot;, &amp;n);
    //fprintf(stderr, &quot;?&quot;);
    read(n);
    std::fill(head + 1, head + n + 1, 0);
    tail = 1;

    for (int i = 1; i &lt; n; i++) {
      int u, v, w;
      //scanf(&quot;%d%d%d&quot;, &amp;u, &amp;v, &amp;w);
      read(u);
      read(v);
      read(w);
      insert(u, v, w);
    }

    //scanf(&quot;%d&quot;, &amp;m);
    read(m);
    for (int i = 1; i &lt;= m; i++) {
      //scanf(&quot;%d%d%lld&quot;, x + i, y + i, v + i);
      read(x[i]), read(y[i]), read(v[i]);
    }

    solver1::main();
  }
}
</code></pre>
				<br />
				
				<label for="result"> 评测结果 </label><div class="row"><div class="col-xs-12"><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Compilation</b></td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">N/A</td><td class="col-xs-2" style="vertical-align:middle">Compile OK</td><td class="col-xs-2" style="vertical-align:middle">Score: N/A</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_1" aria-expanded="false" aria-controls="detail_1">显示更多</a></td></tr></table></div><div class="collapse" id="detail_1"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>Compiling...
Compile success!
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #1</b></td><td class="col-xs-2" style="vertical-align:middle">337.46 us</td><td class="col-xs-2" style="vertical-align:middle">1 MB + 248 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_2" aria-expanded="false" aria-controls="detail_2">显示更多</a></td></tr></table></div><div class="collapse" id="detail_2"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.337463
mem_kb = 1272
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #2</b></td><td class="col-xs-2" style="vertical-align:middle">640.28 us</td><td class="col-xs-2" style="vertical-align:middle">1 MB + 296 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_3" aria-expanded="false" aria-controls="detail_3">显示更多</a></td></tr></table></div><div class="collapse" id="detail_3"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 0.640281
mem_kb = 1320
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #3</b></td><td class="col-xs-2" style="vertical-align:middle">5.849 ms</td><td class="col-xs-2" style="vertical-align:middle">2 MB + 24 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_4" aria-expanded="false" aria-controls="detail_4">显示更多</a></td></tr></table></div><div class="collapse" id="detail_4"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 5.848730
mem_kb = 2072
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #4</b></td><td class="col-xs-2" style="vertical-align:middle">76.218 ms</td><td class="col-xs-2" style="vertical-align:middle">8 MB + 736 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_5" aria-expanded="false" aria-controls="detail_5">显示更多</a></td></tr></table></div><div class="collapse" id="detail_5"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 76.218158
mem_kb = 8928
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #5</b></td><td class="col-xs-2" style="vertical-align:middle">1.859 s</td><td class="col-xs-2" style="vertical-align:middle">93 MB + 796 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_6" aria-expanded="false" aria-controls="detail_6">显示更多</a></td></tr></table></div><div class="collapse" id="detail_6"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1859.142094
mem_kb = 96028
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #6</b></td><td class="col-xs-2" style="vertical-align:middle">3.529 s</td><td class="col-xs-2" style="vertical-align:middle">162 MB + 440 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_7" aria-expanded="false" aria-controls="detail_7">显示更多</a></td></tr></table></div><div class="collapse" id="detail_7"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 3528.983195
mem_kb = 166328
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #7</b></td><td class="col-xs-2" style="vertical-align:middle">673.19 ms</td><td class="col-xs-2" style="vertical-align:middle">38 MB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_8" aria-expanded="false" aria-controls="detail_8">显示更多</a></td></tr></table></div><div class="collapse" id="detail_8"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 673.190334
mem_kb = 38912
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #8</b></td><td class="col-xs-2" style="vertical-align:middle">1.294 s</td><td class="col-xs-2" style="vertical-align:middle">64 MB + 64 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_9" aria-expanded="false" aria-controls="detail_9">显示更多</a></td></tr></table></div><div class="collapse" id="detail_9"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1293.834047
mem_kb = 65600
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #9</b></td><td class="col-xs-2" style="vertical-align:middle">1.301 s</td><td class="col-xs-2" style="vertical-align:middle">63 MB + 136 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_10" aria-expanded="false" aria-controls="detail_10">显示更多</a></td></tr></table></div><div class="collapse" id="detail_10"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1300.807640
mem_kb = 64648
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #10</b></td><td class="col-xs-2" style="vertical-align:middle">368.288 ms</td><td class="col-xs-2" style="vertical-align:middle">31 MB + 320 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_11" aria-expanded="false" aria-controls="detail_11">显示更多</a></td></tr></table></div><div class="collapse" id="detail_11"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 368.288138
mem_kb = 32064
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #11</b></td><td class="col-xs-2" style="vertical-align:middle">808.895 ms</td><td class="col-xs-2" style="vertical-align:middle">68 MB + 964 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_12" aria-expanded="false" aria-controls="detail_12">显示更多</a></td></tr></table></div><div class="collapse" id="detail_12"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 808.894570
mem_kb = 70596
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #12</b></td><td class="col-xs-2" style="vertical-align:middle">828.222 ms</td><td class="col-xs-2" style="vertical-align:middle">69 MB + 456 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_13" aria-expanded="false" aria-controls="detail_13">显示更多</a></td></tr></table></div><div class="collapse" id="detail_13"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 828.222262
mem_kb = 71112
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #13</b></td><td class="col-xs-2" style="vertical-align:middle">910.339 ms</td><td class="col-xs-2" style="vertical-align:middle">30 MB + 224 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_14" aria-expanded="false" aria-controls="detail_14">显示更多</a></td></tr></table></div><div class="collapse" id="detail_14"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 910.339309
mem_kb = 30944
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #14</b></td><td class="col-xs-2" style="vertical-align:middle">907.833 ms</td><td class="col-xs-2" style="vertical-align:middle">30 MB + 132 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_15" aria-expanded="false" aria-controls="detail_15">显示更多</a></td></tr></table></div><div class="collapse" id="detail_15"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 907.832951
mem_kb = 30852
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #15</b></td><td class="col-xs-2" style="vertical-align:middle">1.454 s</td><td class="col-xs-2" style="vertical-align:middle">64 MB + 616 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_16" aria-expanded="false" aria-controls="detail_16">显示更多</a></td></tr></table></div><div class="collapse" id="detail_16"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1453.890423
mem_kb = 66152
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #16</b></td><td class="col-xs-2" style="vertical-align:middle">1.334 s</td><td class="col-xs-2" style="vertical-align:middle">53 MB + 108 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_17" aria-expanded="false" aria-controls="detail_17">显示更多</a></td></tr></table></div><div class="collapse" id="detail_17"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1334.297841
mem_kb = 54380
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #17</b></td><td class="col-xs-2" style="vertical-align:middle">640.057 ms</td><td class="col-xs-2" style="vertical-align:middle">36 MB + 244 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_18" aria-expanded="false" aria-controls="detail_18">显示更多</a></td></tr></table></div><div class="collapse" id="detail_18"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 640.056772
mem_kb = 37108
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #18</b></td><td class="col-xs-2" style="vertical-align:middle">1.245 s</td><td class="col-xs-2" style="vertical-align:middle">61 MB + 692 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_19" aria-expanded="false" aria-controls="detail_19">显示更多</a></td></tr></table></div><div class="collapse" id="detail_19"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1244.702478
mem_kb = 63156
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #19</b></td><td class="col-xs-2" style="vertical-align:middle">1.048 s</td><td class="col-xs-2" style="vertical-align:middle">69 MB + 356 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_20" aria-expanded="false" aria-controls="detail_20">显示更多</a></td></tr></table></div><div class="collapse" id="detail_20"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1048.154828
mem_kb = 71012
Correct Answer
</textarea></div></div><div class="alert alert-success"><div class="text-center row"><table class="table table-borderless" style="margin:0px"><tr><td class="col-xs-2" style="vertical-align:middle;padding-left:20px;padding-right:20px"><b>Testcase #20</b></td><td class="col-xs-2" style="vertical-align:middle">1.001 s</td><td class="col-xs-2" style="vertical-align:middle">64 MB + 412 KB</td><td class="col-xs-2" style="vertical-align:middle">Accepted</td><td class="col-xs-2" style="vertical-align:middle">Score: 5</td><td class="col-xs-2" style="vertical-align:middle"><a data-toggle="collapse" href="#detail_21" aria-expanded="false" aria-controls="detail_21">显示更多</a></td></tr></table></div><div class="collapse" id="detail_21"><br /><textarea class="form-control" style="background-color: white" rows="8" readonly>verdict = Run Finished
time_ms = 1000.888176
mem_kb = 65948
Correct Answer
</textarea></div></div></div></div>
			</div>
		</div>
	</div>

	<hr />
	
	<div class="row">
		<p style="text-align: center; color: #888">
			Judge Duck Online | 评测鸭在线 <br />
			Server Time: 2019-08-02 17:15:40 | Loaded in 18 ms | <a href="/status/index.html"> Server Status </a> <br />
			个人娱乐项目，仅供学习交流使用
		</p>
	</div>
</div>

</body>

</html>
